The performance of fast Givens rotations problem implemented with MPI extensions in multicomputers
نویسنده
چکیده
In this paper, issues related to implementing an MPI version of the fast Givens rotations problem are investigated. We have chosen this algorithm because it has the feature of having no predictable communication pattern. Message Passing Interface (MPI) is an attempt to standardise the communication library for distributed memory computing systems. The message-passing paradigm is attractive because of its wide portability and scalability. It is easily compatible with both distributed-memory multicomputers and shared-memory multiprocessors, with NOWs and also combinations of these elements. Currently, there are several commercial and free, public-domain, implementations of MPI. We have chosen the most common implementation of MPI called MPICH. In this paper we show the MPI algorithm of the fast Givens rotations and give some preliminary results about the performance in a network of personal computers. Our results will also point out the strength and weakness of the implementation.
منابع مشابه
Eecient Implementations of Pipelined Cordic Based Iir Digital Filters Using Fast Orthonormal -rotations
CORDIC based IIR digital lters possess desirable properties for VLSI implementations such as regularity, local connection, low sensitivity to nite word-length implementation, and elimination of limit cycles. Recently, ne-grain pipelined CORDIC based IIR digital lter architectures which can perform the ltering operations at arbitrarily high sample rates at the cost of linear increase in hardware...
متن کاملEfficient implementations of pipelined CORDIC based IIR digital filters using fast orthonormal μ-rotations
CORDIC based IIR digital lters are orthogonal lters whose internal computations consist of orthogonal transformations. These lters possess desirable properties for VLSI implementations such as regularity, local connection, low sensitivity to nite word-length implementation, and elimination of limit cycles. Recently, ne-grain pipelined CORDIC based IIR digital lter architectures which can perfor...
متن کاملA Parallel Algorithm for the Reduction of a Nonsymmetric Matrix to Block Upper-Hessenberg Form
In this paper, we present an algorithm for the reduction to block upper-Hessenberg form which can be used to solve the nonsymmetric eigenvalue problem on message-passing multicomputers. On such multicomputers, a nonsymmetric matrix can be distributed across processing nodes logically configured into a two-dimensional mesh using the block-cyclic data distribution. Based on the matrix partitionin...
متن کاملImproving the Performance of Parallel Triangularization of a Sparse Matrix Using a Reconfigurable Multicomputer
Many applications require the solution of a least-squares (LS) problem from a coe cient matrix and a measurement vector. In some cases, the solution must be obtained within a short period of time, requiring great computation power, as is the case of state estimation in electric power systems. In some cases, the coe cient matrix is a large and sparse one, requiring special techniques to reduce t...
متن کاملParallel Strategies for Rank-k Updating of the QR Decomposition
Parallel strategies based on Givens rotations are proposed for updating the QR decomposition of an n × n matrix after a rank-k change (k < n). The complexity analyses of the Givens algorithms are based on the total number of Givens rotations applied to a 2-element vector. The algorithms, which are extensions of the rank-1 updating method, achieve the updating using approximately 2(k + n) compou...
متن کامل